A Nonlinear Real Arithmetic Fragment
نویسندگان
چکیده
We present a new procedure for testing satisfiability (over the reals) of a conjunction of polynomial equations. There are three possible return values for our procedure: it either returns a model for the input formula, or it says that the input is unsatisfiable, or it fails because the applicability condition for the procedure, called the eigen-condition, is violated. For the class of constraints where the eigen-condition holds, our procedure is a decision procedure. We describe satisfiability-preserving transformations that can potentially convert problems into a form where eigen-condition holds. We experimentally evaluate the procedure and discuss applicability.
منابع مشابه
EFSMT: A Logical Framework for Cyber-Physical Systems
The design of cyber-physical systems is challenging in that it includes the analysis and synthesis of distributed and embedded real-time systems for controlling, often in a nonlinear way, the environment. We address this challenge with EFSMT, the exists-forall quantified first-order fragment of propositional combinations over constraints (including nonlinear arithmetic), as the logical framewor...
متن کاملDynamical Control of Computations Using the Family of Optimal Two-point Methods to Solve Nonlinear Equations
One of the considerable discussions for solving the nonlinear equations is to find the optimal iteration, and to use a proper termination criterion which is able to obtain a high accuracy for the numerical solution. In this paper, for a certain class of the family of optimal two-point methods, we propose a new scheme based on the stochastic arithmetic to find the optimal number of iterations in...
متن کاملTHE USE OF THE HE'S ITERATION METHOD FOR SOLVING NONLINEAR EQUATIONS USING CADNA LIBRARY
In this paper, we apply the Newton’s and He’s iteration formulas in order to solve the nonlinear algebraic equations. In this case, we use the stochastic arithmetic and the CESTAC method to validate the results. We show that the He’s iteration formula is more reliable than the Newton’s iteration formula by using the CADNA library.
متن کاملValue Groups of Real Closed Fields and Fragments of Peano Arithmetic
We investigate real closed fields admitting an integer part of which non-negative cone is a model of Peano Arithmetic (or of its fragment I∆0 + EXP ). We obtain necessary conditions on the value group of such a real closed field. These allow us to construct a class of examples of real closed fields which do not admit such integer parts.
متن کاملJBernstein: A Validity Checker for Generalized Polynomial Constraints
Efficient and scalable verification of nonlinear real arithmetic constraints is essential in many automated verification and synthesis tasks for hybrid systems, control algorithms, digital signal processors, and mixed analog/ digital circuits. Despite substantial advances in verification technology, complexity issues with classical decision procedures for non-linear real arithmetic are still a ...
متن کاملOn Solving Systems of Equations Using Interval Arithmetic
Introduction. In this paper, we consider the problem of applying interval arithmetic to bound a solution of a system of nonlinear equations. Moore [1, Section 7.3] has discussed the same problem. His approach, as well as ours, is to extend the multidimensional Newton method and implement it in interval arithmetic. In Section 2, it is shown that a particular detail of Moore's method can be modif...
متن کامل